Makespan Computation for Cyber Manufacturing Centre Using Bottleneck Analysis : A Re - entrant Flow Shop Problem
نویسنده
چکیده
This paper presents the development of an alternative method for makespan computation algorithms of a re-entrant flow shop scheduling problem using bottleneck analysis. The computation is specifically intended for the cyber manufacturing centre (CMC) which is an Internet based collaborative design and manufacturing services at Universiti Tun Hussein Onn Malaysia. The CMC processes scheduling resembles a four machine permutation re-entrant flow shop with the process routing of M1,M2,M3,M4,M3,M4. It was shown that under the sequence dependent bottleneck characteristics, the makespan can be accurately determined by the algorithm developed using bottleneck analysis. In cases where the bottleneck limitation is violated, the makespan can still be accurately determined by the introduction of bottleneck correction factor.
منابع مشابه
Solving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملBottleneck-Based Makespan Algorithm For Cyber Manufacturing System
This paper presents alternative makespan computation algorithms for cyber manufacturing system (CMS) using bottleneck analysis. The CMS is an Internet-based collaborative design and manufacturing activities between Universiti Tun Hussein Onn Malaysia and the small and medium enterprises. The CMS processes scheduling resembles a four machine flow shop process routing of M1,M2,M3,M4,M3,M4 in whic...
متن کاملMethodology To Develop Heuristic For Re-Entrant Flow Shop With Two Potential Dominant Machines Using Bottleneck Approach
This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy of the makespan c...
متن کاملMakespan Algorithms and Heuristic for Internet-Based Collaborative Manufacturing Process Using Bottleneck Approach
This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. The collaborative manufacturing process resembles a permutation re-entrant flow shop environment with four machines executing the process routing of M1,M2,M3,M4,M3,M4 in which the combination of the last three processes of M4,M3,M4 has ...
متن کامل